applic raga base sa calcul critic water depth open channel supersed nearest neighbor search uncertain spatial databas paper propos problem call supersed nearest neighbor search uncertain spatial databas object multidimension probabl densiti function queri point object nearest neighbor nn candid probabl nn nn candid supersed closer object supersed nearest neighbor snn supersed nn candid object supersed nn candid case return snncore minimum set nn candid supersed nn candid snn core intuit snn core object object snn core wors object snn core show snn core effici comput util convent multidimension index confirm extens experi increment gener evalu revers nearest neighbor paper present algorithm increment gener evalu continu revers nearest neighbor queri igern short igern algorithm gener applic continu monochromat bichromat revers nearest neighbor queri problem face number applic enhanc servic armi strateg plan main challeng problem maintain date queri answer dataset frequent time previou algorithm monochromat continu revers nearest neighbor queri reli monitor worst case pie region igern take radic approach monitor singl region queri object igern algorithm outperform state art algorithm monochromat queri propos optim monochromat igern reduc number nearest neighbor search filter refin approach igern fr igern propos continu evalu bichromat revers nearest neighbor queri optim version previou approach comput complex igern fr igern present comparison state art algorithm monochromat bichromat case addit correct igern fr igern monochromat bichromat case prove extens experiment analysi synthet real dataset show igern fr igern effici scalabl outperform previou techniqu continu revers nearest neighbor queri workload ddriven compress skycub queri wireless applic extend hash hash dbase index paper present hash base index structur base bloom filter call breadth depth bloom filter contrast tradit hash base index summar hierarch data support regular path express queri describ structur resourc discoveri peer peer network implement structur experi show outperform simpl bloom filter discov resourc fo model comput design algorithm larg scale applic essenti problem minim commun geograph inform system gi good exampl larg scale applic frequent handl huge amount spatial data paper develop effici extern memori algorithm number import problem involv line segment plane includ trapezoid decomposit batch planar point locat triangul red blue line segment intersect report gener line segment intersect report gi system problem render model frequent overlai map extract inform linear hash set linear affin transform vector space finit field studi good class hash function hash set size rang cardin randomli chosen function expect size largest hash bucket univers class hash function finit field respect measur field behav differ finit field element bad set ae size expect maxim bucket size omega gamma perfect squar bad set largest bucket size worst respect univers class hash function set size expect largest bucket size field element bound previous upper bound dtree tree de facto standard file organ file index user dedic databas system gener purpos access method propos nnplement tree paper review tree show success discuss major variat tree tree resourc alloc problem spatial databas angel enhanc util gener privaci preserv public gener method privaci preserv data public vast popular drawback heavi inform loss difficulti support margin public overcom drawback develop angel anonym techniqu effect gener privaci protect retain significantli inform microdata angel applic monoton principl divers close superior correl preserv obviou tight privaci control enforc show angel lend elegantli hard problem margin public unlik gener releas restrict margin techniqu easili publish margin strong privaci guarante angel enhanc util gener privaci preserv public gener method privaci preserv data public vast popular drawback heavi inform loss difficulti support margin public overcom drawback develop angel anonym techniqu effect gener privaci protect retain significantli inform microdata angel applic monoton principl divers close superior correl preserv obviou tight privaci control enforc show angel lend elegantli hard problem margin public unlik gener releas restrict margin techniqu easili publish margin strong privaci guarante continu monitor top dk move object relat group score function acm sigspati address issu relat acquisit manag process spatial relat inform focu algorithm geometr visual consider scope includ limit geograph inform system current acm sigspati offic skylin flexibl domin relat abstract set dimension object skylin queri find object skylin domin skylin provid queri result user exist method skylin queri drawback size skylin object control increas decreas skylin object built rank skylin reflect user weight prefer dimens paper propos unifi approach skylin effect solv drawback explor properti skylin propos algorithm comput skylin monitor top dk unsaf place acm sigspati address issu relat acquisit manag process spatial relat inform focu algorithm geometr visual consider scope includ limit geograph inform system current acm sigspati offic anti dcorrupt privaci preserv public abstract paper deal type privaci threat call corrupt anonym data public specif adversari corrupt individu obtain sensit valu consult releas inform convent gener lead sever privaci disclosur presenc corrupt motiv advoc altern anonym techniqu integr gener perturb stratifi sampl integr strong privaci guarante adversari corrupt number individu verifi effect propos techniqu experi real data aggreg queri spatial fastest dpath comput effici fastest path comput presenc vari speed condit larg scale road network essenti problem modern navig system factor affect road speed weather time dai vehicl type consid order select fast rout match current drive condit exist system comput fastest path base road euclidean distanc small set predefin road speed histori teacher histor traffic data drive pattern simpl euclidean distanc base comput peopl good reason choos rout avoid pass high crime area night encount accid road construct traffic jam paper present adapt fastest path algorithm capabl effici account import drive speed pattern mine larg set traffic data algorithm base observ hierarchi road partit road network area path pre comput strategi area level limit rout search strategi edg path segment frequent travel data driver travers road network largest road distanc trip small road signific speed advantag larg extens experiment evalu real road network show algorithm desir short support rout significantli faster compet method comput tempor aggreg rang predic tempor aggreg queri import costli oper applic maintain timeevolv data data warehous tempor databas due larg volum data perform improv tempor aggreg queri critic paper examin techniqu comput tempor aggreg includ kei rang predic rang tempor aggreg concentr sum count avg aggreg problem handl arbitrari kei rang previou method separ index kei rang propos approach base index structur call multivers sb tree incorpor featur sb tree multivers tree handl arbitrari kei rang tempor sum count avg queri analyz perform approach present experiment result show effici mine frequent gener itemset gener associ rule redund queryscop visual queri repeat databas tune understand perceiv pattern isaiah berlin read perceiv complex sql queri time consum task tradit databas applic decad decis support system automat gener highli nest sql queri human understand tune workload challeng demonstr explor visual method repres queri graph develop queryscop tool visual understand critic element queri cut learn curv show tool user drill queri find similarli structur queri exhibit similar tune opportun queri shown demonstr real tune engag advanc spatial tempor databas present theori motion topolog point view symbol perspect take space time histori object primit entiti introduc tempor topolog relat defin space time character class spatial theori account qualit spatial inform deal underspecifi symbol inform accur data unnecessari show structur give basi commonsens spatio tempor reason present number signific deduct theori serv formal basi languag describ motion event qualit continu evalu monochromat bichromat revers nearest neighbor paper present algorithm increment gener evalu continu revers nearest neighbor queri igern short igern algorithm gener applic monochromat bichromat revers nearest neighbor queri increment aspect igern achiev determin small set object monitor previou algorithm monochromat queri reli monitor pie region igern take radic approach monitor singl region queri object igern algorithm outperform state theart algorithm monochromat queri addit igern algorithm present attempt continu evalu bichromat revers nearest neighbor queri comput complex igern present comparison state art algorithm monochromat case voronoi diagram bichromat case addit correct igern monochromat bichromat case prove extens experiment analysi show igern effici scalabl outperform previou techniqu continu revers nearest neighbor queri multidimension danonym local recod gener paper present theoret studi local recod gener lrg comput kanonym tabl qualiti guarante prove np hard find tabl maximum qualiti discov solut approxim ratio develop algorithm good balanc approxim ratio time complex qualiti solut verifi experi continu evalu monochromat bichromat revers nearest neighbor paper present algorithm increment gener evalu continu revers nearest neighbor queri igern short igern algorithm gener applic monochromat bichromat revers nearest neighbor queri increment aspect igern achiev determin small set object monitor previou algorithm monochromat queri reli monitor pie region igern take radic approach monitor singl region queri object igern algorithm outperform state theart algorithm monochromat queri addit igern algorithm present attempt continu evalu bichromat revers nearest neighbor queri comput complex igern present comparison state art algorithm monochromat case voronoi diagram bichromat case addit correct igern monochromat bichromat case prove extens experiment analysi show igern effici scalabl outperform previou techniqu continu revers nearest neighbor queri effici mine max frequent pattern gener environ poster paper summar solut mine max frequent gener itemset itemset compact represent frequent pattern gener environ categori subject descriptor inform find fastest path road network speed pattern paper propos solv time interv fastest path allfp queri user defin leav arriv time interv sourc node end node allfp ask set fastest path interv note queri algorithm find partit interv exist method solv special case problem leav time singl time instant straightforward solut allfp queri run exist method time time instant paper propos solut base extens algorithm expand network time expand travel time path function leav time method combin travel time function provid expand path lower bound estim travel time propos perform result reveal method effici accur discret time approach continu revers nearest neighbor monitor paper studi problem continu monitor revers nearest neighbor queri exist continu revers nearest neighbor monitor techniqu sensit object queri movement result queri recomput queri locat present framework continu revers nearest neighbor queri assign object queri rectangular safe region expens recomput requir long queri object remain respect safe region significantli improv comput cost product framework reduc commun cost client server architectur object report locat server leav safe region server send locat updat request conduct rigid cost analysi guid effect select rectangular safe region extens experi demonstr techniqu outperform exist techniqu order magnitud term comput cost commun cost refresh sky compress skycub effici support frequent updat skylin queri import applic multi criteria decis make data mine userprefer queri set dimension object skylin queri find object domin practic user interest dimens data issu queri subset dimens paper focus support concurr unpredict subspac skylin queri frequent updat databas simpli comput store skylin object subspac skycub incur expens updat cost paper investig import issu updat skycub dynam environ balanc queri cost updat cost propos structur compress skycub concis repres complet skycub explor properti compress skycub provid effici object awar updat scheme experiment result show compress skycub queri updat effici progress comput min ddist optim dlocat queri paper propos solv min dist optim locat queri spatial databas set site set weight object spatial region min dist optim locat queri return locat site built minim averag distanc object closest site queri franchis mcdonald decid put store order maxim benefit custom solv problem challeng theoret infinit number locat candid paper theorem limit number candid locat lose power find exact answer progress algorithm quickli suggest locat tell maximum error refin result algorithm finish exact answer found intermedi result earli run prune search space run crucial prune techniqu lower bound estim propos algorithm effect optim progress experiment evalu support complex queri multivers xml document manag multipl version xml document repres critic requir applic recent work support complex queri xml data regular path express structur project paper examin problem implement effici complex queri multivers xml document approach reli number scheme durabl node number dnn preserv order node xml tree remain invari respect updat document dnn show complex queri reduc combin rang version retriev queri examin altern storag organ index scheme effici evalu rang version retriev queri environ perform analysi present reveal advantag scheme support complex queri multivers xml document manag multipl version xml document repres critic requir applic recent work support complex queri xml data regular path express structur project paper examin problem implement effici complex queri multivers xml document approach reli number scheme durabl node number dnn preserv order node xml tree remain invari respect updat document dnn show complex queri reduc combin rang version retriev queri examin altern storag organ index scheme effici evalu rang version retriev queri environ perform analysi present reveal advantag scheme improv dtree outlier handl techniqu tree state art spatial index found commerci system oracl paper aim improv queri perform tree focu wide spatial queri rang queri aggreg queri nearest neighbor queri skylin queri join queri idea store outlier object intern tree node structur name tree outlier object locat object larg extent point object object extent object store higher level tree lower level node smaller minimum bound rectangl index perform support dynam natur index structur algorithm need paper discuss show identifi handl outlier object page overflow underflow gain loss metric extens experi reveal tree significantli outperform tree queri close pair queri move object databas databas move object import air traffic control ground traffic battlefield configur introduc histor spatial rang close pair queri move object import problem databas purpos rang close pair queri move object find pair object closer time interv spatial rang user paramet paper solv rang close pair queri compon retriev compon close pair identif compon retriev compon break long trajectori trajectori segment produc increas time order sort retriev compon take advantag index mechan multipl tsb tree segment pipelin close pair identif compon identif compon introduc spatial sweep sweep time spatial dimens time extens experiment result provid demonstr advantag approach close pair optim dlocat queri paper propos solv min dist optim locat queri spatial databas set site set weight object spatial region min dist optim locat queri return locat site built minim averag distanc object closest site queri franchis mcdonald decid put store order maxim benefit custom solv problem challeng theoret infinit number locat candid paper theorem limit number candid locat lose power find exact answer progress algorithm quickli suggest locat tell maximum error refin result algorithm finish exact answer found intermedi result earli run prune search space run crucial prune techniqu lower bound estim propos algorithm effect optim progress experiment evalu comput top dt influenti spatial site set weight object set site queri site bichromat rnn queri comput influenc set set object nearest site site influenc site defin total weight rnn paper address interest problem find top influenti site insid spatial region straightforward approach find site comput rnn site approach effici reason site identifi whatsoev number larg site tree object tree brows larg number time site tree site brows identifi influenc region polygon region rnn tree object brows find rnn set paper propos algorithm call topinfluentialsit find top influenti site brows tree systemat prune optim spatial min fmax aggreg onlin event ddriven subsequ match financi data stream improv dtree spatial index gain floss metric onlin event ddriven subsequ match financi data stream spatial drang closest dpair queri abstract import queri spatial databas research find closest pair object space exist work assum object closest pair data set index tree closest pair space found optimz tree join techniqu techniqu doesn perform data set ident doesn work search rang area space paper address closest pair problem data set propos practic extens closest pair problem involv queri rang problem find closest pair object insid rang extend exist techniqu solv problem propos index structur base augment tree give algorithm maintain structrur experiment result show structur robust earlier approach tempor spatio dtempor aggreg data stream multipl time granular tempor spatio tempor aggreg paper examin problem comput aggreg data stream aggreg maintain multipl level tempor granular older data aggreg coarser granular recent data aggreg finer detail present special index scheme dynam progress maintain tempor spatio tempor aggreg scheme parameter level granular index size valid length dynam adjust trade aggreg detail storag space analyt experiment result show effici propos structur address tempor aggreg problem gener framework aggreg multipl time granular propos final show util framework solv rang tempor spatio tempor aggreg problem recent progress select topic databas research report young chines research work unit state effici complex queri support multivers xml document manag multipl version xml document repres critic requir applic recent interest support complex queri xml data regular path express structur project diff queri paper examin problem support effici complex queri multivers xml document approach reli scheme base durabl node number dnn preserv order xml tree node invari respect updat document dnn complex queri reduc combin partial versio retriev queri examin index scheme effici evalu partial version retriev queri environ perform analysi present reveal advantag scheme tempor aggreg data stream multipl granular tempor aggreg import costli oper applic maintain time evolv data data warehous tempor databas paper examin problem comput tempor aggreg data stream aggreg maintain multipl level tempor granular older data aggreg coarser granular recent data aggreg finer detail present special index scheme dynam progress maintain tempor aggreg advanc databas aggreg queri process effici tempor join process indic examin problem process tempor join presenc index scheme previou work tempor join concentr index relat fulli scan larg data volum creat increas time dimens sequenti scan prohibit true tempor join involv part join relat time interv timelin util index benefici direct join data interest tempor join algorithm repres index scheme tree tree tempor index multivers tree mvbt tree tree result simpl effici join algorithm index achiev good tempor data cluster cluster maintain mvbt record copi copi greatli affect correct effect join algorithm identifi problem propos effici solut optim extens comparison index base tempor join varieti dataset queri characterist show mvbt base join algorithm consist faster link base algorithm robust behavior experi show ten fold improv tree join thirti time faster tree join effici aggreg object extent examin problem effici comput sum count avg aggreg index base process semi drestrict tempor join tempor join import costli oper tempor join involv time kei domain gener case join defin time kei rectangl space user interest join portion larg tempor data restrict join object rectangl join base kei equal interv intersect paper concentr semi restrict join kei equal equi join interv intersect timejoin predic larg relat creat increas time dimens assum tempor relat index examin effici wai process semi restrict tempor join util index help direct join object time kei rectangl straightforward approach perform unsynchron join index select queri relat identifi object time kei rectangl join simpl approach ignor data distribut relat synchron join indic concurr travers join comput synchron semi restrict join algorithm perform util tradit indic tree tree drawback approach tradit indic achiev good tempor data cluster cluster achiev tempor indic record copi record copi greatli affect correct effect join perform paper introduc correct effici algorithm perform semi restrict tempor join tempor indic extens experiment comparison show newli propos algorithm perform paper concentr multivers tree algorithm appli equal effici tree base tempor indic effici structur join index xml document queri xml document typic combin select element content path express structur relationship tag element structur join find pair element satisfi primit structur relationship queri parent child ancestor descend relationship effici support structur join kei effici implement xml queri recent propos node number scheme enabl captur xml document structur ing tradit indic tree tree paper propos effici struc tural join algorithm presenc tag indic concentr tree show expedit structur join avoid collect element particip join intro duce enhanc base sibl pointer improv perform sibl pointer easili implement dynam maintain present structur join algorithm util tree effici comput tempor aggreg rang predic tempor aggreg queri import costli oper applic maintain timeevolv data data warehous tempor databas due larg volum data perform improv tempor aggreg queri critic paper examin techniqu comput tempor aggreg includ kei rang predic rang tempor aggreg concentr sum count avg aggreg problem handl arbitrari kei rang previou method separ index kei rang propos approach base index structur call multivers sb tree incorpor featur sb tree multivers tree handl arbitrari kei rang tempor sum count avg queri analyz perform approach present experiment result show effici store queri multivers xml document durabl node number manag multipl version xml document repres import problem tradit applic softwar configur control link perman web document research manag multivers xml document seek provid effici robust techniqu store retriev queri document paper present approach version manag achiev object scheme base durabl node number timestamp element xml document present effici storag retriev techniqu multivers document explor index cluster strategi need assur effici support complex queri content document evolut 